package practise.alogrithm.gotoSiliconValley.array;

/**
 * Search number in a rotate array.
 * still using the divide-conquer method.
 */
public class SearchRotatedArray {
}
